An Improved Snap-Stabilizing PIF Algorithm
نویسندگان
چکیده
A snap-stabilizing protocol, starting from any arbitrary initial configuration, always behaves according to its specification. In [10], Cournier and al. present the first snap-stabilizing Propagation of Information with Feedback (PIF) protocol in arbitrary networks. But, in order to achieve the desirable property of snap-stabilization, the algorithm needs the knowledge of the exact size of the network. This drawback prevents the protocol from working on dynamical systems. In this paper, we propose an original protocol which solves this drawback.
منابع مشابه
Snap-Stabilizing PIF Algorithm in Tree Networks Without Sense Of Direction
A snap-stabilizing protocol, starting from any arbitrary initial system configuration, always behaves according to its specification. In other words, a snap-stabilizing protocol is a self-stabilizing protocol which stabilizes in 0 steps. In this paper, we propose a snap-stabilizing PIF algorithm for tree networks without any sense of direction. This algorithm allows us to maintain only one (ins...
متن کاملState-optimal snap-stabilizing PIF in tree networks
In this paper, we introduce the notion of snapstabilization. A snap-stabilizing algorithm protocol guarantees that, starting from an arbitrary system configuration, the protocol always behaves according to its specification. So, a snap-stabilizing protocol is a self-stabilizing protocol which stabilizes in 0 steps. We propose a snap-stabilizing Propagation of Information with Feedback (PIF) sch...
متن کاملOptimal snap-stabilizing PIF algorithms in un-oriented trees
A snap-stabilizing protocol, starting from any arbitrary initial system configuration, always behaves according to its specification. In other words, a snap-stabilizing protocol is a self-stabilizing protocol which stabilizes in zero steps. In this paper, we first prove the number of states required on processors to design a snap-stabilizing Propagation of Information with Feedback (PIF) algori...
متن کاملThe expressive power of snap-stabilization
A snap-stabilizing algorithm, regardless of the initial configuration of the system, guarantees that it always behaves according to its specification. We consider here the locally shared memory model. In this model, we propose the first snap-stabilizing Propagation of Information with Feedback (PIF) algorithm for rooted networks of arbitrary connected topology which is proven assuming the distr...
متن کاملOptimal PIF in Tree Networks
In this paper, we consider rooted tree networks, as well as trees without sense of direction. We propose a new PIF scheme, called Propagation of Information with Feedback and Cleaning (PF C ). We present both selfstabilizing and snap-stabilizing PF C algorithms. A self-stabilizing system, regardless of the initial states of the processors and initial messages in the links, is guaranteed to conv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003